Fast Elliptic Curve Algorithm Combining Frobenius Map and Table Reference to Adapt to Higher Characteristic
نویسندگان
چکیده
A new elliptic curve scalar multiplication algorithm is proposed. The algorithm o ers about twice the troughput of some conventional OEF-base algorithms because it combines the Frobenius map with the table reference method based on baseexpansion. Furthermore, since this algorithm suits conventional computational units such as 16, 32 and 64 bits, its base eld F p m is expected to enhance elliptic curve operation e ciency more than F q (q is a prime) or F 2 n .
منابع مشابه
Skew-Frobenius map on twisted Edwards curve
In this paper, we consider the Frobenius endomorphism on twisted Edwards curve and give the characteristic polynomial of the map. Applying the Frobenius endomorphism on twisted Edwards curve, we construct a skew-Frobenius map defined on the quadratic twist of an twisted Edwards curve. Our results show that the Frobenius endomorphism on twisted Edwards curve and the skew-Frobenius endomorphism o...
متن کاملFast Computation Methods for Scalar Multiplication on Elliptic Curves Defined over Higher Characteristic Finite Field
In this paper, we propose three algorithms to perform scalar multiplication on elliptic curves defined over higher characteristic finite fields such as the OEF (Optimal Extension Field). First, we propose an efficient scalar multiplication method in which the Frobenius expansion is used on an elliptic curve defined over OEF. Second, we propose a new finite field multiplication algorithm. Third,...
متن کاملTwo Efficient Algorithms for Arithmetic of Elliptic Curves Using Frobenius Map
In this paper, we present two efficient algorithms computing scalar multiplications of a point in an elliptic curve defined over a small finite field, the Frobenius map of which has small trace. Both methods use the identity which expresses multiplication-by-m maps by polynomials of Frobenius maps. Both are applicable for a large family of elliptic curves and more efficient than any other metho...
متن کاملComputing the cardinality of CM elliptic curves using torsion points
Let E/Q be an elliptic curve having complex multiplication by a given quadratic order of an imaginary quadratic field K. The field of definition of E is the ring class field Ω of the order. If the prime p splits completely in Ω, then we can reduce E modulo one the factors of p and get a curve E defined over Fp. The trace of the Frobenius of E is known up to sign and we need a fast way to find t...
متن کاملEfficient elliptic curve cryptosystems
Elliptic curve cryptosystems (ECC) are new generations of public key cryptosystems that have a smaller key size for the same level of security. The exponentiation on elliptic curve is the most important operation in ECC, so when the ECC is put into practice, the major problem is how to enhance the speed of the exponentiation. It is thus of great interest to develop algorithms for exponentiation...
متن کامل